Power-Grid-Partitioning Model and its Tabu-Search-Embedded Algorithm for Zonal Pricing
نویسندگان
چکیده
منابع مشابه
Power-Grid-Partitioning Model and its Tabu-Search-Embedded Algorithm for Zonal Pricing
Power grid partition is a major problem in power markets based on zonal marginal price (ZMP). As the preparation of modeling, the zone of a node set is defined as the minimum-girthed convex polygon containing these nodes, and a theorem judging common nodes between two zones of node sets is proposed. Then, the power-grid-partitioning problem is described as a combinatorial optimization model, an...
متن کاملA Tabu search algorithm for the network pricing problem
In this paper, we propose an efficient Tabu Search procedure for solving the NP-hard network pricing problem. By exploiting the problem’s features, the algorithm allows the near-optimal solution of problem instances that are out of reach of exact combinatorial methods. & 2012 Elsevier Ltd. All rights reserved.
متن کاملOptimal Power Flow Using Tabu Search Algorithm
This paper presents an e cient and reliable tabu search (TS)–based approach to solve the optimal power ow (OPF) problem. The proposed approach employs TS algorithm for optimal settings of the control variables of the OPF problem. Incorporation of TS as a derivative-free optimization technique in solving OPF problem signicantly reduces the computational burden. One of the main advantages of T...
متن کاملGraph Partitioning Using Tabu Search
In this paper, we present another approach to the balanced minimum cut graph partitioning problem. This approach is based on the meta-heuristic known as tabu search. Our experimental results compare favorably with two of the most effecitive methods available in terms of quality of solutions and computational times. Our experience and experiments suggest that this technique can be applied effect...
متن کاملConvergent Tabu Search for Optimal Partitioning
We consider a specialization of tabu search for optimal partitioning problems, which can be used to model a wide variety of binary discrete optimization problems. Our method constitutes a form of tree search that applies under more general assumptions than standard tree search approaches. Moreover, the method allows combinations of problem restriction and problem relaxation strategies that are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2008
ISSN: 1474-6670
DOI: 10.3182/20080706-5-kr-1001.02692